Algorithmic Decision Theory within Discrete Complex Networks
نویسندگان
چکیده
Algorithmic decision theory becomes more and more important. We will present a theoretical and practical point of view to the role of networks and dynamic flow problems in complex environments. To support a decision support management a comfortable software implementation for solving multiobjective discrete control and dynamic flow problems on networks will be presented. As many processes from various economic areas such as information technology, transportation systems, multi-agent resource management, power distribution etc. can be modeled as such multiobjective discrete control and optimal flow problems on dynamic networks. For such kind of problems specific discrete algorithms as well as their robust implementations will be derived and analyzed. The talk will exploit a novel combination of discrete optimization methods and basic game-theoretic concepts to support an optimal decision support management process. Keyword: Algorithmic Decision Theory, Network, Critical Infrastructure, Decision Support System
منابع مشابه
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
In a recent paper [10], an algorithmic approach was presented for the robust (minmax regret) absolute deviation location problem on networks with vertex weights which are linear functions of an uncertain or dynamically changing parameter. In this paper, we present algorithmic and analytical improvements that significantly reduce the computational complexity bounds for the algorithm.
متن کاملUsing the Theory of Network in Finance
It is very important for managers, investors and financial policy-makers to detect and analyze factors affecting financial markets to obtain optimal decision and reduce risks. The importance of market analysis and attempt to improve its behavior understanding, has led analysts to use the experiences of other professionals in the fields such as social sciences and mathematics to examine the inte...
متن کاملNumerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues
We undertake an extensive numerical investigation of the graph spectra of thousands regular graphs, a set of random Erdös-Rényi graphs, the two most popular types of complex networks and an evolving genetic network by using novel conceptual and experimental tools. Our objective in so doing is to contribute to an understanding of the meaning of the Eigenvalues of a graph relative to its topologi...
متن کاملAlgorithmic Networks: central time to trigger expected emergent open-endedness
This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied question is how much emergent complexity arises when a population of computable systems is networked compared with when this population is isolated. First, we...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008